Simple Compact Monotone Tree Drawings
نویسندگان
چکیده
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several papers and, recently, He and He [6] showed how to produce a monotone drawing of an arbitrary n-vertex tree that is contained in a 12n× 12n grid. In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n× n.
منابع مشابه
Optimal Monotone Drawings of Trees
A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u,w in G, there exists a path Puw in G that is monotone in some direction luw. (Namely, the order of the orthogonal projections of the vertices of Puw on luw is the same as the order they appear in Puw.) The problem of finding monotone drawings for trees has been studied in several recent paper...
متن کاملCompact Encodings of Planar Orthogonal Drawings
We present time-efficient algorithms for encoding (and decoding) planar orthogonal drawings of degree-4 and degree-3 biconnected and triconnected planar graphs using small number of bits. We also present time-efficient algorithms for encoding (and decoding) turn-monotone planar orthogonal drawings.
متن کاملOn Monotone Drawings of Trees
A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with n vertices on an O(n) × O(n) grid whose angles are close to the best possible angular resolution. Our drawings are convex, that is, if every edge to a leaf is substituted by a ray, the (un...
متن کاملCompact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we prove that the limiting distribution for the depth in a PAT tree is the same as the limiting distribution for the depth in a PATRICIA trie, even...
متن کاملA Simple Algorithm for Constructing Perfect Monolinear Sona Tree Drawings, and its Application to Visual Art Education
The traditional sona drawing art of Angola is compared from the structural point of view to similar geometric arts found in other parts of the world. A simple algorithm is proposed for constructing a sub-class of sona drawings, called perfect monolinear sona drawings, on a given set of points in the plane, that exhibit the topological structure of a tree. The application of the tree sona drawin...
متن کامل